Two Dimensional-IP Routing

Efficient Two Dimensional-IP routing: An incremental deployment design

China Education and Research Network 2 (CERNET2) is deploying Two Dimensional-IP (TwoD-IP) routing. That is, the forwarding decision of each router is not only based on the destination address, but also on the source address. One driving force is that the network needs the ability to divert traffic flows (identified by their source and destination IPs and we call them the VIP flows) to pre-defi...

Compressing Two-Dimensional Routing Tables1

We consider an algorithmic problem that arises in the context of routing tables used by Internet routers. The Internet addressing scheme is hierarchical, where a group of hosts are identified by a prefix that is common to all the hosts in that group. Each host machine has a unique 32-bit address. Thus, all traffic between a source group s and a destination group d can be routed along a particul...

IP Routing and Mobility

The original design of the Internet and its underlying protocols did not anticipate users to be mobile. With the growing interest in supporting mobile users and mobile computing, a great deal of work is taking place to solve this problem. For a solution to be practical, it has to integrate easily with existing Internet infrastructure and protocols, and offer an adequate migration path toward wh...

Global Wiire Routing in Two-Dimensional Arrayst

Very Brief Abstract We examine the .problem of routing wires on a VLSI chip, where the pins to be· connected are arranged in a regular rectangular array. We obtain tight bounds for the worst-case "channelwidth" needed to route an n X n array, and develop provably good heuristics for the general case. An interesting "rounding algorithm for obtaining integral approximations to solutions of linear...

12. IP Routing Algorithms